A Conic Integer Programming Approach to Constrained Assortment Optimization under the Mixed Multinomial Logit Model
نویسندگان
چکیده
We consider the constrained assortment optimization problem under the mixed multinomial logit model. Even moderately sized instances of this problem are challenging to solve directly using standard mixed-integer linear optimization formulations. This has motivated recent research exploring customized optimization strategies and approximation techniques. In contrast, we develop a novel conic quadratic mixed-integer formulation. This new formulation, together with McCormick inequalities exploiting the capacity constraints, enables the solution of large instances using commercial optimization software.
منابع مشابه
Joint Optimization of Assortment Selection and Pricing under the Capacitated Multinomial Logit Choice Model with Product-Differentiated Price Sensitivities
Joint Optimization of Assortment Selection and Pricing under the Capacitated Multinomial Logit Choice Model with Product-Differentiated Price Sensitivities Ruxian Wang HP Laboratories HPL-2012-207 Multinomial Logit model; assortment optimization; multi-product price optimization Many firms face a problem to select an assortment of products and determine their prices to maximize the total prof...
متن کاملConstrained Assortment Optimization for the Nested Logit Model
We study assortment optimization problems where customer choices are governed by the nested logit model and there are constraints on the set of products offered in each nest. Under the nested logit model, the products are organized in nests. Each product in each nest has a fixed revenue associated with it. The goal is to find a feasible set of products, i.e. a feasible assortment, to maximize t...
متن کاملOn upper bounds for assortment optimization under the mixture of multinomial logit models
The assortment optimization problem under the mixture of multinomial logit models is NPcomplete and there are different approximation methods to obtain upper bounds on the optimal expected revenue. In this paper, we analytically compare the upper bounds obtained by the different approximation methods. We propose a new, tractable approach to construct an upper bound on the optimal expected reven...
متن کاملAssortment Optimization under Unknown MultiNomial Logit Choice Models
Motivated by e-commerce, we study the online assortment optimization problem. The seller offers an assortment, i.e. a subset of products, to each arriving customer, who then purchases one or no product from her offered assortment. A customer’s purchase decision is governed by the underlyingMultiNomial Logit (MNL) choice model. The seller aims to maximize the total revenue in a finite sales hori...
متن کاملAssortment Optimization under the Sequential Multinomial Logit Model
We study the assortment optimization problem under the Sequential Multinomial Logit (SML), a discrete choice model that generalizes the multinomial logit (MNL). Under the SML model, products are partitioned into two levels, to capture differences in attractiveness, brand awareness and, or visibility of the products in the market. When a consumer is presented with an assortment of products, she ...
متن کامل